On Bisimilarity of Higher-Order Pushdown Automata: Undecidability at Order Two

We show that bisimulation equivalence of order-two pushdown automata is undecidable. Moreover, we study the lower order problem of higher-order pushdown automata, which asks, given an order-k pushdown automaton and some k\u27= 2 even when the input k-PDA is deterministic and real-time

The implementation of a generalized table driven back end processor

Includes bibliographical references.This thesis discusses the University of Cape Town implementation of a table driven back end processor. The back end processor takes as input an intermediate tree representation of a high level programming language. It produces as output an object text ready for assembly. The specifications of the input tree and the output object are supplied to the back end processor via two tables. The initial motivation for this project was the need to provide a back end processor capable of taking the DIANA tree output of the University of Cape Town front end processor and producing a corresponding P-code object. The University of Cape Town back end processor is implemented using Pascal and C in a Unix V environment

Saturation-Based Model Checking of Higher-Order Recursion Schemes

Model checking of higher-order recursion schemes (HORS) has recently been studied extensively and applied to higher-order program verification. Despite recent efforts, obtaining a scalable model checker for HORS remains a big challenge. We propose a new model checking algorithm for HORS, which combines two previous, independent approaches to higher-order model checking. Like previous type-based algorithms for HORS, it directly analyzes HORS and outputs intersection types as a certificate, but like Broadbent et al.\u27s saturation algorithm for collapsible pushdown systems (CPDS), it propagates information backward, in the sense that it starts with target configurations and iteratively computes their pre-images. We have implemented the new algorithm and confirmed that the prototype often outperforms TRECS and CSHORe, the state-of-the-art model checkers for HORS

Recursion Schemes and Logical Reflection

International audienceLet R be a class of generators of node-labelled infinite trees, and L be a logical language for describing correctness properties of these trees. Given r in R and phi in L, we say that r_phi is a phi-reflection of r just if (i) r and r_phi generate the same underlying tree, and (ii) suppose a node u of the tree t(r) generated by r has label f, then the label of the node u of t(r_phi) is f* if u in t(r) satisfies phi; it is f otherwise. Thus if t(r) is the computation tree of a program r, we may regard r_phi as a transform of r that can internally observe its behaviour against a specification phi. We say that R is (constructively) reflective w.r.t. L just if there is an algorithm that transforms a given pair (r,phi) to r_phi. In this paper, we prove that higher-order recursion schemes are reflective w.r.t. both modal mu-calculus and monadic second order (MSO) logic. To obtain this result, we give the first characterisation of the winning regions of parity games over the transition graphs of collapsible pushdown automata (CPDA): they are regular sets defined by a new class of automata. (Order-n recursion schemes are equi-expressive with order-n CPDA for generating trees.) As a corollary, we show that these schemes are closed under the operation of MSO-interpretation followed by tree unfolding a la Caucal

Recursion Schemes and Logical Reflection

International audienceLet R be a class of generators of node-labelled infinite trees, and L be a logical language for describing correctness properties of these trees. Given r in R and phi in L, we say that r_phi is a phi-reflection of r just if (i) r and r_phi generate the same underlying tree, and (ii) suppose a node u of the tree t(r) generated by r has label f, then the label of the node u of t(r_phi) is f* if u in t(r) satisfies phi; it is f otherwise. Thus if t(r) is the computation tree of a program r, we may regard r_phi as a transform of r that can internally observe its behaviour against a specification phi. We say that R is (constructively) reflective w.r.t. L just if there is an algorithm that transforms a given pair (r,phi) to r_phi. In this paper, we prove that higher-order recursion schemes are reflective w.r.t. both modal mu-calculus and monadic second order (MSO) logic. To obtain this result, we give the first characterisation of the winning regions of parity games over the transition graphs of collapsible pushdown automata (CPDA): they are regular sets defined by a new class of automata. (Order-n recursion schemes are equi-expressive with order-n CPDA for generating trees.) As a corollary, we show that these schemes are closed under the operation of MSO-interpretation followed by tree unfolding a la Caucal

Health state utility values for diabetic retinopathy: protocol for a systematic review and meta-analysis

Background People with diabetic retinopathy tend to have lower levels of health-related quality of life than individuals with no retinopathy. Strategies for screening and treatment have been shown to be cost-effective. In order to reduce the bias in cost-effectiveness estimates, systematic reviews of health state utility values (HSUVs) are crucial for health technology assessment and the development of decision analytic models. A review and synthesis of HSUVs for the different stages of disease progression in diabetic retinopathy has not previously been conducted. Methods/Design We will conduct a systematic review of the available literature that reports HSUVs for people with diabetic retinopathy, in correspondence with current stage of disease progression and/or visual acuity. We will search Medline, EMBASE, Web of Science, Cost-Effectiveness Analysis Registry, Centre for Reviews and Dissemination Database, and EconLit to identify relevant English-language articles. Data will subsequently be synthesized using linear mixed effects modeling meta-regression. Additionally, reported disease severity classifications will be mapped to a four-level grading scale for diabetic retinopathy. Discussion The systematic review and meta-analysis will provide important evidence for future model-based economic evaluations of technologies for diabetic retinopathy. The meta-regression will enable the estimation of utility values at different disease stages for patients with particular characteristics and will also highlight where the design of the study and HSUV instrument have influenced the reported utility values. We believe this protocol to be the first of its kind to be published

MendelianRandomization v0.5.0: updates to an R package for performing Mendelian randomization analyses using summarized data.

The MendelianRandomization package is a software package written for the R software environment that implements methods for Mendelian randomization based on summarized data. In this manuscript, we describe functions that have been added to the package or updated in recent years. These features can be divided into four categories: robust methods for Mendelian randomization, methods for multivariable Mendelian randomization, functions for data visualization, and the ability to load data into the package seamlessly from the PhenoScanner web-resource. We provide examples of the graphical output produced by the data visualization commands, as well as syntax for obtaining suitable data and performing a Mendelian randomization analysis in a single line of code

Effects of Reapeated Doses of Caffeine on Performance and Alertness: New Data and Secondary Analyses

Rationale The effects of caffeine on mood and performance are well established. Some authors suggest that caffeine merely reverses effects of caffeine withdrawal rather than having direct behavioural effects. It has also been suggested that withdrawal may be removed by a first dose of caffeine and further doses have little subsequent effect. These issues were examined here. Objectives The present study aimed to determine whether caffeine withdrawal influenced mood and performance by comparing regular consumers who had been withdrawn from caffeine overnight with non-consumers. Following this repeated caffeine doses were administered to test the claim that repeated dosing has no extra effect on mood or performance. Secondary analyses of a data collected by Christopher et al. (2003) were also carried out to examine some alternative explanations of their results which showed effects of caffeine after a day of normal caffeine consumption. Methods One hundred and twenty volunteers participated in the study. Regular caffeine consumption was assessed by questionnaire and this showed that thirty six of the sample did not regularly consume caffeinated beve rages. Volunteers were instructed to abstain from caffeine overnight and then completed a baseline session measuring mood and a range of cognitive functions at 08.00 the next day. Following this volunteers were given 0, or 1mg/kg caffeine in a milkshake, glucose solution or water (at 09:00), followed by a second 0 or 1mg/kg caffeine dose (at 09:40) and the test battery repeated at 10:00. Results The baseline data showed no effect of overnight caffeine withdrawal on mood or performance. In contrast, caffeine challenge improved vigilance performance and prevented decreases in alertness induced by completion of the task battery. The magnitude of these effects increased as a function of the number of doses of caffeine given. Secondary analyses of data from Christopher et al. (2003) also confirmed that effects of caffeine did not depend on length of withdrawal. Conclusions The present findings show no effect of overnight caffeine withdrawal on mood and performance. Caffeine challenge did have the predicted effect on alertness and vigilance, with the size of the effects increasing with caffeine dose. These findings suggest that the effects of caffeine are not due to reversal of effects of withdrawal, a view confirmed by secondary analyses of data collected after a day of normal caffe ine consumption